An Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling

Tabu Search Based Hyper-heuristic Approaches to Examination Timetabling

A graph-based hyper-heuristic for educational timetabling problems

This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...

Case Based Heuristic Selection for Examination Timetabling

The work presented in this paper could be thought of as a case based hyper-heuristic approach for examination timetabling problems. A hyper-heuristic can be taken to be an automated approach to choose heuristics. Heuristics and meta-heuristics are employed in this capacity in [1] and [2]. In this paper the case-based paradigm is explored as a heuristic selector for examination timetabling probl...

Analysing the High Level Heuristics within a Graph Based Hyper-heuristic

This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...

A Simulated Annealing Hyper-heuristic for University Course Timetabling

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...